Cutting a Convex Polyhedron Out of a Sphere
نویسندگان
چکیده
Given a convex polyhedron P of n vertices inside a sphere Q, we give an O(n)-time algorithm that cuts P out of Q by using guillotine cuts and has cutting cost O(log n) times the optimal.
منابع مشابه
Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere
For a given convex polyhedron P of n vertices inside a sphere Q , we study the problem of cutting P out of Q by a sequence of plane cuts. The cost of a plane cut is the area of the intersection of the plane with Q , and the objective is to find a cutting sequence that minimizes the total cost. We present three approximation solutions to this problem: an O(n log n) time O(log2 n)-factor approxim...
متن کاملCorner Polyhedra and Maximal Lattice-free Convex Sets : A Geometric Approach to Cutting Plane Theory
Corner Polyhedra were introduced by Gomory in the early 60s and were studied by Gomory and Johnson. The importance of the corner polyhedron is underscored by the fact that almost all “generic” cutting planes, both in the theoretical literature as well as ones used in practice, are valid for the corner polyhedron. So the corner polyhedron can be viewed as a unifying structure from which many of ...
متن کاملUnfolding Convex Polyhedra via Quasigeodesics
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds the surface to a planar simple polygon.
متن کاملUnfolding Convex Polyhedra via Radially Monotone Cut Trees
A notion of “radially monotone” cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut is infinitesimally opened by the curvature at the vertices along the path. It is shown that a class of planar, triangulated convex domains always have a rad...
متن کاملHow to Cut out a Convex Polyhedron
It is known that one can fold a convex polyhedron from a non-overlapping face unfolding, but the complexity of the algorithm in [MP] remains an open problem. In this paper we show that every convex polyhedron P ⊂ R can be obtained in polynomial time, by starting with a cube which contains P and sequentially cutting out the extra parts of the surface. Our main tool is of independent interest. We...
متن کامل